Step of Proof: preorder_wf
12,41
postcript
pdf
Inference at
*
I
of proof for Lemma
preorder
wf
:
T
:Type,
R
:(
T
T
). Preorder(
T
;
x
,
y
.
R
(
x
,
y
))
latex
by ((Unfold `preorder` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat
C
3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
x
,
y
.
t
(
x
;
y
)
,
P
&
Q
,
x
(
s1
,
s2
)
,
Preorder(
T
;
x
,
y
.
R
(
x
;
y
))
,
t
T
,
,
x
:
A
.
B
(
x
)
Lemmas
trans
wf
,
refl
wf
origin